|
In operations research, the glove problem (also known as the condom problem〔Vardi, I. The Condom Problem. Ch. 10 in ''Computational Recreations in Mathematica''. Redwood City, CA: Addison–Wesley, pp. 203–222, 1991. ISBN 0-201-52989-0.〕) is an optimization problem used as an example that the cheapest capital cost often leads to dramatic increase in operational time, but that the shortest operational time need not be given by the most expensive capital cost. ==Problem statement== ''M'' doctors are each to examine each of ''N'' patients, wearing gloves to avoid contamination. Each glove can be used any number of times, but the same side of one glove cannot be exposed to more than one person. Gloves can be re-used any number of times, and more than one can be used simultaneously. Given ''M'' doctors and ''N'' patients, the minimum number of gloves ''G''(''M'' ,''N'') required for all the doctors to examine all the patients is given by: * ''G''(''M'', ''N'') = ''M'' + ''N'' − 2 if both ''M'', ''N'' ≥ 2 * ''G''(''M'', 1) = ''M'' * ''G''(1, ''N'') = ''N'' * ''G''(1, 1) = 1 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Glove problem」の詳細全文を読む スポンサード リンク
|